Losing recognizability

The Recognizability of Authenticity

The goals of this research were to (1) determine if there is agreement both amongst viewers, and between viewers and the performer, about the extent to which performances are authentic, and (2) ascertain whether or not performers and/or viewers can distinguish between authenticity and skill. An authentic performance is one that is natural or genuine, while an inauthentic performance feels faked...

Algebraic Recognizability of Languages

Recognizable languages of finite words are part of every computer science cursus, and they are routinely described as a cornerstone for applications and for theory. We would like to briefly explore why that is, and how this word-related notion extends to more complex models, such as those developed for modeling distributed or timed behaviors. In the beginning was the Word. . . Recognizable lang...

Uniform and nonuniform recognizability

Fuzzy Graph Language Recognizability

Fuzzy graph language recognizability is introduced along the lines of the established theory of syntactic graph language recognizability by virtue of the algebraic structure of magmoids. The main closure properties of the corresponding class are investigated and several interesting examples of fuzzy graph languages are examined.

Does o-Substitution Preserve Recognizability?

Substitution operations on tree series are at the basis of systems of equations (over tree series) and tree series transducers. Tree series transducers seem to be an interesting transformation device in syntactic pattern matching. In this contribution, it is shown that o-substitution preserves recognizable tree series provided that the target tree series is linear and the semiring is idempotent...